       int indexSP = 0;
                bool isSp = false;
                POINT leftEndPoint;
                POINT Miny = track.spurroad[0];
                if (track.pointsEdgeLeft[rowBreakLeftUp].y < 5)
                {
                    for (int Li = 0; Li < track.spurroad.size(); Li++)
                    {
                        if (track.pointsEdgeLeft[rowBreakLeftUp].y < track.spurroad[Li].y && track.spurroad[Li].x < ROWSIMAGE / 2 && track.spurroad[Li].y < COLSIMAGE / 2)
                        {
                            if (track.spurroad[Li].y <= track.spurroad[indexSP].y && track.spurroad[Li].y > track.pointsEdgeLeft[rowBreakLeftUp].y)
                            {
                                isSp = true;
                                indexSP = Li;
                            }
                            if (track.spurroad[Li].y < Miny.y)
                            {
                                Miny = track.spurroad[Li];
                            }
                        }
                    }
                    if (isSp)
                    {
                        leftEndPoint = track.spurroad[indexSP];
                    }
                    else if (abs(Miny.y - track.pointsEdgeLeft[rowBreakLeftDown].y) <=abs((COLSIMAGE /2) - track.pointsEdgeLeft[rowBreakLeftDown].y))
                    {
                        leftEndPoint = Miny;
                    }else {
                        leftEndPoint = POINT(track.pointsEdgeLeft[rowBreakLeftDown].x,(track.pointsEdgeLeft[rowBreakLeftDown].y + COLSIMAGE)*2 /3);
                    }
                }
                else
                {
                    leftEndPoint = track.pointsEdgeLeft[rowBreakLeftUp];
                }
                k = (float)(leftEndPoint.y - track.pointsEdgeLeft[rowBreakLeftDown].y) / (float)(leftEndPoint.x - track.pointsEdgeLeft[rowBreakLeftDown].x);
                b = leftEndPoint.y - k * leftEndPoint.x;
                cout << k << endl;
                for (int i = rowBreakLeftDown; i < rowBreakLeftUp; i++)
                { // i改成rowBreakLeftUp-i,k * track.pointsEdgeLeft[i].x + b,改成 k * track.pointsEdgeLeft[rowBreakLeftUp-i].x + b + track.pointsEdgeLeft[rowBreakLeftDown].y
                    track.pointsEdgeLeft[i].y = max((int)(k * track.pointsEdgeLeft[i].x + b), 0);
                }